Discrete Logarithm Based Cryptosystems in Quadratic Function Fields of Characteristic 2
نویسندگان
چکیده
We present a key exchange scheme similar to that of Diie and Hellman using the infrastructure of quadratic function elds of even characteristic. This is a modiication of the results of Scheidler, Stein and Williams who used quadratic function elds of odd characteristic. We also extend these results to give a digital signature scheme similar to that of ElGamal. These schemes are possible in this structure even though it is not a group. Finally we examine the security of such systems, and give a possible attack based on Pohlig and Hellman's attack on discrete logarithms in nite groups.
منابع مشابه
Computing discrete logarithms in real quadratic congruence function fields of large genus
The discrete logarithm problem in various finite abelian groups is the basis for some well known public key cryptosystems. Recently, real quadratic congruence function fields were used to construct a public key distribution system. The security of this public key system is based on the difficulty of a discrete logarithm problem in these fields. In this paper, we present a probabilistic algorith...
متن کاملAn efficient blind signature scheme based on the elliptic curve discrete logarithm problem
Elliptic Curve Cryptosystems (ECC) have recently received significant attention by researchers due to their high performance such as low computational cost and small key size. In this paper a novel untraceable blind signature scheme is presented. Since the security of proposed method is based on difficulty of solving discrete logarithm over an elliptic curve, performance of the proposed scheme ...
متن کاملCatching Kangaroos in Function Fields
1. Introduction In this paper we generalize the parallelized lambda method for computing invariants in real qua-dratic function elds. A basic such invariant is the regulator, which plays an important role in cryptosystems based on real quadratic function elds. For example, in the key-exchange protocol by Scheidler, Stein and Williams SSW96], the regulator provides a measure for the key space; m...
متن کاملSecurity of Cryptosystems Based on Class Groups of Imaginary Quadratic Orders
In this work we investigate the difficulty of the discrete logarithm problem in class groups of imaginary quadratic orders. In particular, we discuss several strategies to compute discrete logarithms in those class groups. Based on heuristic reasoning, we give advice for selecting the cryptographic parameter, i.e. the discriminant, such that cryptosystems based on class groups of imaginary quad...
متن کاملDesign of Hyperelliptic Cryptosystems in Small Characteristic and a Software Implementation over F2n
We investigate the discrete logarithm problem over jacobians of hyperelliptic curves suitable for public-key cryptosystems. We focus on the case when the definition field has small characteristic 2, 3, 5 and 7, then we present hyperelliptic cryptosystems that resist against all known attacks. We further implement our designed hyperelliptic cryptosystems over finite fields F2n in software on Alp...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Des. Codes Cryptography
دوره 14 شماره
صفحات -
تاریخ انتشار 1998